Automated Veri cation by Induction and Associative-Commutative Operators
نویسندگان
چکیده
Theories with associative and commutative (AC) operators, such as arithmetic, process algebras, boolean algebras, sets, : : : are ubiquitous in software and hardware veriication. These AC operators are diicult to handle by automatic deduction since they generate complex proofs. In this paper, we present new techniques for combining induction and AC reasoning, in a rewrite-based theorem prover. The resulting system has proved to be quite successful for veriication tasks. Thanks to its careful rewriting strategy, it needs less interaction on typical veriication problems than well known tools like NQTHM , LP or PVS. We also believe that our approach can easily be integrated as an eecient tactic in other proof systems.
منابع مشابه
Automated Verification by Induction with Associative-Commutative Operators
Theories with associative and commutative (AC) operators, such as arithmetic, process algebras, boolean algebras, sets, : : : are ubiquitous in software and hardware veriication. These AC operators are diicult to handle by automatic deduction since they generate complex proofs. In this paper, we present new techniques for combining induction and AC reasoning, in a rewrite-based theorem prover. ...
متن کاملAn Approach to Link HOL and MDG for Hardware Veri cation
In order to overcome the limitations of automated tools and the cumbersome proof process of interactive theorem proving, we adopt an hybrid approach for formal hardware veri cation by linking HOL and MDG. This approach uses the strengths of theorem proving (HOL) with its powerful mathematical tools such as induction and abstraction, and the advantages of automated tools (MDG) which support equi...
متن کاملAssociative-Commutative Rewriting
We are currently extending the rewrite system labora tory REVE to handle associative-commutative operators. In particular, we are incorporating a set of rules for Boolean algebra that provides a refutationally-complete theorem prover and a new programming paradigm. To that end, we describe methods for proving termination of associativecommutative systems.
متن کاملDouble - Exponential Complexity
A new algorithm for computing a complete set of uniiers for two terms involving associative-commutative function symbols is presented. The algorithm is based on a non-deterministic algorithm given by the authors in 1986 to show the NP-completeness of associative-commutative uniiability. The algorithm is easy to understand, its termination can be easily established. More importantly, its complex...
متن کاملFormal Verification of Real time Software
The veri cation of functionality of the input output logic properties often composes the majority of software requirements analysis Automated theorem provers ATPs such as SRI s Prototype Veri cation System PVS have been successfully used in the formal veri cation of functional properties However such functional methods are not readily applicable to the veri cation of the real time software re q...
متن کامل